3D Surface Matching by a Voxel-Based Buffer-Weighted Binary Descriptor
نویسندگان
چکیده
منابع مشابه
Weighted Multi-Scale Image Matching Based on Harris- Sift Descriptor
According to the rotational invariance of Harris corner detector and the robustness of Sift descriptor. An improved Harris-Sift corner descriptor was proposed. At first, the algorithm given multi-scale strategy to Harris corner, improved corner counting method and removed redundant points at the same time, then, the corner was directly applied to low-pass Gaussian filter image. Based on the his...
متن کاملBinary descriptor-based dense line-scan stereo matching
We present a line-scan stereo system and descriptor-based dense stereo matching for highperformance vision applications. The stochastic binary local descriptor (STABLE) descriptor is a local binary descriptor that builds upon the principles of compressed sensing theory. The most important properties of STABLE are the independence of the descriptor length from the matching window size and the po...
متن کاملA Novel Binary Feature Descriptor for Accelerated Robust Matching
Stereo matching between images is at the base of many computer vision applications. Many traditional image features for matching focus on being robust to view-point changes with huge amount of calculation and memory storage, such as Scale Invariant Feature Transform (SIFT). Binary Robust Independent Elementary Features (BRIEF) is an efficient alternative to traditional SIFT-like features, but i...
متن کاملA Novel Molecular Descriptor Derived from Weighted Line Graph
The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the w...
متن کاملSIFT Descriptor for Binary Shape Discrimination, Classification and Matching
In this work, we study efficiency of SIFT descriptor in discrimination of binary shapes. We also analyze how the use of 2 − tuples of SIFT keypoints can affect discrimination of shapes. The study is divided into two parts, the first part serves as a primary analysis where we propose to compute overlap of classes using SIFT and a majority vote of keypoints. In the second part, we analyze both cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2925364